Paper Trails
نویسندگان
چکیده
منابع مشابه
Paper Audit Trails and Voters' Privacy Concerns
Advances in information technology have simplified many processes in our lives. However, in many cases trust issues arise when new technology is introduced, and voting is one prominent example. To increase voters’ trust, current e-voting systems provide paper audit trails (PATs) which enable automatic tally and/or manual audit of the election result. PATs may contain only the encrypted vote or ...
متن کاملCrossed TRAILs
and colleagues have identified a protein called Hippi as one possible mediator of Huntington disease (HD) neuronal cell death. HD begins with expansion of the polyglutamine repeats in the huntingtin protein (Htt). This frees up Hip1 protein, which normally binds to Htt. Free Hip1 can then bind to the Hippi protein identified by Nicholson, and the two proteins join in a complex with procaspase 8...
متن کاملSpanning trails
A graph is called 2K2-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every 3 2 -tough 2K2-free graph with at least three vertices has a spanning trail with maximum degree at most 4. In this paper, we confirm this conjecture. We also provide examples for all t < 54 of t-tough graphs that do not have a spanning trail with maximum degre...
متن کاملColored Trails: A Multiagent System Testbed for Decision-Making Research (Demo Paper)
With increasing frequency, computer agents participate in collaborative and competitive multiagent domains in which humans reason strategically to make decisions. The deployment of computer agents in such domains requires that the agents understand something about human behavior so that they can interact successfully with people; the computer agents must be sensitive to how people reason in str...
متن کاملOn paths, trails and closed trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed trails. Given a c-edge-colored graph G, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex is specified before hand. As a consequence, we solve a number of interesting related problems. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: arcadia
سال: 2014
ISSN: 1613-0642,0003-7982
DOI: 10.1515/arcadia-2014-0004